E cient Parallel Algorithms for Two Graph Layout Problems
نویسنده
چکیده
We present e cient parallel algorithms for solving two graph layout problems: Find a F ary Embedding on a grid and construct a rectangular dual for planar graphs. The algorithm for the rst problem takes O(logn log n) time with O(n) processors on a PRAM. The algorithm for the second problem takes O(log 2 n) time with O(n) processors.
منابع مشابه
Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملChapter in SYNTHESIS OF PARALLEL ALGORITHMS
This report deals with a parallel algorithmic technique that has proved to be very useful in the design of e cient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called \open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an e cient parallel algorithm for nding this decomposition a...
متن کاملOn Finding Minimal Two-Connected Subgraphs
Wepresent e cient parallel algorithms for the problems of nding a minimal2-edge-connected spanning subgraph of a 2-edge-connected graph and nding a minimalbiconnected spanning subgraph of a biconnected graph. The parallel algorithms run in polylog time using a linear number of PRAM processors. We also give linear time sequential algorithms for minimally augmenting a spanning tree into a 2-edge-...
متن کاملImplementation of Parallel Graph Algorithms
Graphs play an important role in modeling the underlying structure of many real world problems. Over the past couple of decades, e cient sequential algorithms have been developed for several graph problems and have been implemented on sequential machines. The NETPAD system at Bellcore is a general tool for graph manipulations and algorithm design that facilitates such implementations. More rece...
متن کاملThe design and analysis of bulk-synchronous parallel algorithms
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...
متن کامل